Covering graph

Results: 53



#Item
11Maximum Motif Problem in Vertex-Colored Graphs  ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1

Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:28:57
12Variance of the subgraph count for sparse Erd˝ os-R´ enyi graphs Robert B. Ellis a,1,∗ , James P. Ferry b,1 a Department

Variance of the subgraph count for sparse Erd˝ os-R´ enyi graphs Robert B. Ellis a,1,∗ , James P. Ferry b,1 a Department

Add to Reading List

Source URL: math.iit.edu

Language: English - Date: 2009-09-14 16:32:12
13Cubical coloring — fractional covering by cuts Robert Sˇa´mal Abstract We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own, it is useful for s

Cubical coloring — fractional covering by cuts Robert Sˇa´mal Abstract We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own, it is useful for s

Add to Reading List

Source URL: iti.mff.cuni.cz

Language: English - Date: 2016-02-04 05:53:37
    14Obstructions for three-coloring graphs without induced paths on six vertices Maria Chudnovsky∗1 , Jan Goedgebeur†2 , Oliver Schaudt3 , and Mingxian Zhong4 1  Princeton University, Princeton, NJ 08544, USA. E-mail: mc

    Obstructions for three-coloring graphs without induced paths on six vertices Maria Chudnovsky∗1 , Jan Goedgebeur†2 , Oliver Schaudt3 , and Mingxian Zhong4 1 Princeton University, Princeton, NJ 08544, USA. E-mail: mc

    Add to Reading List

    Source URL: www.zaik.uni-koeln.de

    Language: English - Date: 2015-09-19 08:52:09
    15Covering a graph by forests and a matching Tomáš Kaiser1 Micka¨el Montassier2  André Raspaud2

    Covering a graph by forests and a matching Tomáš Kaiser1 Micka¨el Montassier2 André Raspaud2

    Add to Reading List

    Source URL: iti.mff.cuni.cz

    Language: English - Date: 2016-02-04 05:53:38
      16Math 205B - Topology Dr. Baez January 19, 2007 Christopher Walker TheoremThe map p : R → S 1 given by the equation p(x) = (cos(2πx), sin(2πx))

      Math 205B - Topology Dr. Baez January 19, 2007 Christopher Walker TheoremThe map p : R → S 1 given by the equation p(x) = (cos(2πx), sin(2πx))

      Add to Reading List

      Source URL: math.ucr.edu

      Language: English - Date: 2007-01-24 21:19:53
      17PageRank and random walks on graphs Fan Chung and Wenbo Zhao University of California, San Diego La Jolla, CA 92093, US {fan,pedu,w3zhao}@ucsd.edu

      PageRank and random walks on graphs Fan Chung and Wenbo Zhao University of California, San Diego La Jolla, CA 92093, US {fan,pedu,w3zhao}@ucsd.edu

      Add to Reading List

      Source URL: www.math.ucsd.edu

      Language: English - Date: 2010-04-14 15:27:19
      18MATH 205B REVIEW HOMEWORK Definitions — give precise definitions for these terms. 1. Path homotopy. 2. Functor. 3. Covering space.

      MATH 205B REVIEW HOMEWORK Definitions — give precise definitions for these terms. 1. Path homotopy. 2. Functor. 3. Covering space.

      Add to Reading List

      Source URL: math.ucr.edu

      Language: English - Date: 2007-03-04 22:05:28
      19QUASIRANDOM GROUPS W. T. Gowers Abstract. Babai and Sos have asked whether there exists a constant c > 0 such that every finite group G has a product-free subset of size at least c|G|: that is, a subset X that does not c

      QUASIRANDOM GROUPS W. T. Gowers Abstract. Babai and Sos have asked whether there exists a constant c > 0 such that every finite group G has a product-free subset of size at least c|G|: that is, a subset X that does not c

      Add to Reading List

      Source URL: www.dpmms.cam.ac.uk

      Language: English - Date: 2006-10-22 13:27:46
      20On the Pagenumber of Bipartite Orders Mustafa Alhashem∗ Guy-Vincent Jourdan∗  ∗

      On the Pagenumber of Bipartite Orders Mustafa Alhashem∗ Guy-Vincent Jourdan∗ ∗

      Add to Reading List

      Source URL: www.cccg.ca

      Language: English - Date: 2005-07-31 13:55:47